Computing the volume of a high-dimensional semi-unsupervised hierarchical copula

نویسندگان

  • Enrico Bernardi
  • Silvia Romagnoli
چکیده

We propose an algorithm for the computation of the volume of a multivariate copula function (and the probability distribution of the counting variable linked to this multidimensional copula function) which is very complex for large dimensions. As it is common practice for large dimensional problem, we restrict to positive orthant dependence and we construct a Hierarchical copula which describes the joint distribution of random variables accounting for dependence among them. This approach approximates a multivariate distribution function of heterogenous variables with a distribution of a fixed number of homogenous clusters, organized through a semi-unsupervised clustering method. These clusters, representing the second level sectors of Hierarchical copula function, are characterized by an into-sector dependence parameter determined by a method which is very similar to the Diversity Score method. The algorithm, implemented in MatLab code, is particularly efficient allowing us to treat cases with a large number of variables, as can be seen in our scalability analysis. As an application, we study the problem of valuing the risk exposure of an insurance company, given the marginals i.e. the risks of each policy. University of Bologna, Department of Mathematical Economics, Viale Filopanti 5, 40126 Bologna, Italy. Phone: +(39) 0512094345; Fax: +(39) 0512094357. e-mail: [email protected] University of Bologna, Department of Mathematical Economics, Viale Filopanti 5, 40126 Bologna, Italy. Phone: +(39) 0512094340; Fax: +(39) 0512094340. e-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Dimensional Unsupervised Active Learning Method

In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...

متن کامل

Combining Classifier Guided by Semi-Supervision

The article suggests an algorithm for regular classifier ensemble methodology. The proposed methodology is based on possibilistic aggregation to classify samples. The argued method optimizes an objective function that combines environment recognition, multi-criteria aggregation term and a learning term. The optimization aims at learning backgrounds as solid clusters in subspaces of the high...

متن کامل

Combining Classifier Guided by Semi-Supervision

The article suggests an algorithm for regular classifier ensemble methodology. The proposed methodology is based on possibilistic aggregation to classify samples. The argued method optimizes an objective function that combines environment recognition, multi-criteria aggregation term and a learning term. The optimization aims at learning backgrounds as solid clusters in subspaces of the high...

متن کامل

Two and Three Dimensional Monte Carlo Simulation of Magnetite Nanoparticle Based Ferrofluids

We have simulated a magnetite nanoparticle based ferrofluid using Monte Carlo method. Two and three dimensional Monte Carlo simulations have been done using parallel computing technique. The aggregation and rearrangement of nanoparticles embedded in a liquid carrier have been studied in various particle volume fractions. Our simulation results are in complete agreement with the reported experim...

متن کامل

Semi-supervised dimensionality reduction using orthogonal projection divergence-based clustering for hyperspectral imagery

Band clustering and selection are applied to dimensionality reduction of hyperspectral imagery. The proposed method is based on a hierarchical clustering structure, which aims to group bands using an information or similarity measure. Specifically, the distance based on orthogonal projection divergence is used as a criterion for clustering. After clustering, a band selection step is applied to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 88  شماره 

صفحات  -

تاریخ انتشار 2011